Theory of Computation
Q31.
If the strings of a language L can be effectively enumerated in lexicographic (i.e. alphabetic) order, which of the following statements is true?Q32.
Let L_{1}=\{0^{n+m}1^{n}0^{m}|n,m\geq 0\} L_{2}=\{0^{n+m}1^{n+m}0^{m}|n,m\geq 0\} L_{3}=\{0^{n+m}1^{n+m}0^{n+m}|n,m\geq 0\} Which of these languages are NOT context free?Q33.
Consider the languages: L_{1}=\{ww^{R}|w\in \{0,1\}*\} L_{2}=\{w\#w^{R}|w\in \{0,1\}*\},where # is a special symbol L_{3}=\{ww|w\in \{0,1\}*\} Which one of the following is TRUE?Q34.
Let L be a context-free language and M a regular language. Then the language L \cap M isQ35.
Consider the languages: L_{1}=\{a^{n}b^{n}c^{m}|n,m \gt 0\} and L_{2}=\{a^{n}b^{m}c^{m}|n,m \gt 0\} Which one of the following statements is FALSE?Q39.
The two grammars given below generate a language over the alphabet \{x, y, z\} G1 : S \rightarrow x \mid z \mid x \ S \mid z \ S \mid y \ B B \rightarrow y \mid z \mid y \ B \mid z \ B G2 : S \rightarrow y \mid z \mid y \ S \mid z \ S \mid x \ B B \rightarrow y \mid y \ S Which one of the following choices describes the properties satisfied by the strings in these languages?Q40.
Let L denote the languages generated by the grammar S \to 0S0 \mid 00. Which of the following is TRUE?